Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
نویسندگان
چکیده
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-toall broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.
منابع مشابه
Near-Optimal Broadcast in All-Port Wormhole-Routed 3D Tori with Dimension-Ordered Routing
The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optima...
متن کاملRouting and Broadcasting on Incomplete and Gray Code Incomplete Hypercubes
We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal d...
متن کاملOptimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees
In a multiprocessor network, sending a packet typically refers to start-up time and transmission time. To optimize these two times, as opposed to earlier solutions, a spanning tree and multiple spanning trees are constructed to solve four types of broadcasting problems in an (n, k)-star graph: one-to-all or all-to-all broadcasting with either one-port or all-port communication model, respective...
متن کاملOptimal Deadlock-free Routing and Broadcasting on Fibonacci Cube Networks
Hsu recently proposed a new interconnection topology called Fibonacci cubes. ln this correspondence rve show that his routing and broadcasting algori thms do not work correctly and that a routing algorithm by Liu and Hsu does not run in optimal compu_ tation time. we also describe simple optimar deadlock-free routir,s and broadcasting algorithms. The routing algorithm sends ̂ -"rI sa.ge from a s...
متن کاملEfficient Broadcasting in an Arrangement Graph Using Multiple Spanning Trees∗
The arrangement graph An,k is not only a generalization of star graph (n − k = 1), but also more flexible. Designing efficient broadcasting algorithm on a regular interconnection network is a fundamental issue for the parallel processing techniques. Two contributions are proposed in this paper. Initially, we elucidate a first result to construct n − k edge-disjoint spanning trees in an An,k. Se...
متن کامل